Query Answering via Modal Definability with FaCT++: First Blood
نویسندگان
چکیده
We use results on modal definability of first-order formulas to reduce the problem of answering conjunctive queries over knowledge bases (of any expressivity) to checking inconsistency of those knowledge bases extended with a number of ALCI concept assertions. This reduction has been shown to work for conjunctive queries without cycles that only involve bound variables. In this paper, we present an optimised algorithm for the reduction, its implementation using FaCT++ as an underlying reasoner and the results of first experiments.
منابع مشابه
Modal definability of first-order formulas with free variables and query answering
We present an algorithmically efficient criterion of modal definability for first-order existential conjunctive formulas with several free variables. Then we apply it to establish modal definability of some family of first-order ∀∃-formulas. Finally, we use our definability results to show that, in any expressive description logic, the problem of answering modally definable conjunctive queries ...
متن کاملQuery Answering Based on Modal Correspondence Theory
We propose a query answering technique applicable to a wide family of cyclic conjunctive queries with one distinguished variable. It exploits the fact that, given such a query, one can build in linear time a concept of some Description Logic (DL) such that to answer the query w.r.t. any knowledge base (KB) is the same as to find all instances of that concept. Notably, the method is uniform: the...
متن کاملCharacterization, definability and separation via saturated models
Three important results about the expressivity of a modal logic L are the Characterization Theorem (that identifies a modal logic L as a fragment of a better known logic), the Definability theorem (that provides conditions under which a class of L-models can be defined by a formula or a set of formulas of L), and the Separation Theorem (that provides conditions under which two disjoint classes ...
متن کاملModal Definability over a Class of Structures with Two Equivalence Relations
More than 40 years the correspondence between modal logic and first-order logic, when they are interpreted in relational structures, is on the main stream of the investigations of many modal logicians. The most interesting in this direction is a series of results on modal and first-order definability proved by Chagrova in the 1990s. In particular, from them it follows the undecidability of both...
متن کاملDecidability and Complexity of Definability within the Class of All Partitions
This paper is devoted to exploring modal definability of firstorder sentences and first-order definability of modal formulas. It investigates the decidability and the complexity of these problems within the class of all partitions.
متن کامل